The Bernoulli Sieve Revisited
نویسندگان
چکیده
We consider an occupancy scheme in which “balls” are identified with n points sampled from the standard exponential distribution, while the role of “boxes” is played by the spacings induced by an independent random walk with positive and nonlattice steps. We discuss the asymptotic behavior of five quantities: the index K n of the last occupied box, the number Kn of occupied boxes, the number Kn,0 of empty boxes whose index is at most K ∗ n, the index Wn of the first empty box and the number of balls Zn in the last occupied box. It is shown that the limiting distribution of properly scaled and centered K n coincides with that of the number of renewals not exceeding logn. A similar result is shown for Kn and Wn under a side condition that prevents occurrence of very small boxes. The condition also ensures that Kn,0 converges in distribution. Limiting results for Zn are established under an assumption of regular variation.
منابع مشابه
The Bernoulli sieve: an overview
The Bernoulli sieve is a version of the classical balls-in-boxes occupancy scheme, in which random frequencies of infinitely many boxes are produced by a multiplicative random walk, also known as the residual allocation model or stick-breaking. We give an overview of the limit theorems concerning the number of boxes occupied by some balls out of the first n balls thrown, and present some new re...
متن کاملSmall parts in the Bernoulli sieve
Sampling from a random discrete distribution induced by a ‘stick-breaking’ process is considered. Under a moment condition, it is shown that the asymptotics of the sequence of occupancy numbers, and of the small-parts counts (singletons, doubletons, etc) can be read off from a limiting model involving a unit Poisson point process and a self-similar renewal process on the halfline.
متن کاملFactoring Small Integers: An Experimental Comparison
In this data-based paper we report on our experiments in factoring integers from 50 to 200 bits with the postsieving phase of NFS as a potential application. We implemented and compared several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisited the older continued fraction ...
متن کاملEuler-boole Summation Revisited
is a well-known formula from classical analysis giving a relation between the finite sum of values of a function f , whose first m derivatives are absolutely integrable on [a, n], and its integral, for a,m, n ∈ N, a < n. This elementary formula appears often in introductory texts [2, 17], usually in reference to a particular application—Stirling’s asymptotic formula. However, general approaches...
متن کاملFactoring Small to Medium Size Integers: An Experimental Comparison
We report on our experiments in factoring integers from 50 to 200 bit with the NFS postsieving stage or class group structure computations as potential applications. We implemented, with careful parameter selections, several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008